Partial-match retrieval in an index sequential directory
نویسندگان
چکیده
منابع مشابه
Heuristics for Partial - Match Retrieval
This paper considers several practical heuristics for the design of good, if not optimal, partial-match data bases in situations which are typical of real life information retrieval systems. (Submitted to Information Processing Letters) * Work supported in part by U.S. Energy Research and Development Administration under Contract E(Oh.-3)-515. ** Work supported in part by National Science Found...
متن کاملSequential Index Structure for Content-Based Retrieval
Data mining applied to databases of data sequences generates a number of sequential patterns, which often require additional processing. The post-processing usually consists in searching the source databases for data sequences which contain a given sequential pattern or a part of it. This type of content-based querying is not well supported by RDBMSs, since the traditional optimization techniqu...
متن کاملA Directory Index for EXT2
The native filesystem of Linux, Ext2, inherits its basic structure from Unix systems that were in widespread use at the time Linus Torvalds founded the Linux project more than ten years ago. Although Ext2 has been improved and extended in many ways over the years, it still shares an undesireable characteristic with those early Unix filesystems: each directory operation (create, open or delete) ...
متن کاملSequential Match Network: A New Architecture for Multi-turn Response Selection in Retrieval-based Chatbots
We study response selection for multiturn conversation in retrieval-based chatbots. Existing work either concatenates utterances in context or matches a response with a highly abstract context vector finally, which may lose relationships among utterances or important contextual information. We propose a sequential matching network (SMN) to address both problems. SMN first matches a response wit...
متن کاملDPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks
Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. They are essential for information retrieval on large document repositories. However, most current peer-topeer networks for information retrieval are based on distributed hashing and as such cannot support partial-match queries ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1980
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/23.1.37